Breaking Symmetry of Interchangeable Variables and Values
نویسندگان
چکیده
A common type of symmetry is when both variables and values partition into interchangeable sets. Polynomial methods have been introduced to eliminate all symmetric solutions introduced by such interchangeability. Unfortunately, whilst eliminating all symmetric solutions is tractable in this case, pruning all symmetric values is NP-hard. We introduce a new global constraint called SIGLEX and its GAC propagator for pruning some (but not necessarily all) symmetric values. We also investigate how different postings of the SIGLEX constraints affect the pruning performance during constraint solving. Finally, we test these static symmetry breaking constraints experimentally for the first time.
منابع مشابه
Dynamic Posting of Static Symmetry Breaking Constraints∗
We have proposed a method for dynamically posting symmetry breaking constraints to eliminate value interchangeability [1]. We now extend this method to work with any type of symmetry breaking constraint for any type of symmetry. We prove that this method is correct in general. That is, it only eliminates symmetric solutions. We also identify some simple conditions when it eliminates all symmetr...
متن کاملTowards breaking more composition symmetries in partial symmetry breaking
The paper proposes a dynamic method, Recursive Symmetry Breaking During Search (ReSBDS), for efficient partial symmetry breaking. We first demonstrate how Partial Symmetry Breaking During Search (ParSBDS) misses important pruning opportunities when given only a subset of symmetries to break. The investigation pinpoints the culprit and in turn suggests rectification. The main idea is to add extr...
متن کاملReducing Symmetry in Matrix Models: SBDS v. Constraints
We discuss diierent methods of reducing symmetry in CSPs where the variables correspond to the cells of a matrix, and both the rows and the columns of the matrix are interchangeable. Two basic approaches are considered: adding symmetry-breaking constraints to the model, and breaking symmetry during search. We also show how the two approaches can be combined in this case. We empirically compare ...
متن کاملTractable Symmetry Breaking for CSPs with Interchangeable Values
Symmetry breaking in CSPs has attracted considerable attention in recent years. Various general schemes have been proposed to eliminate symmetries during search. In general, these schemes may take exponential space or time to eliminate all symmetries. This paper studies classes of CSPs for which symmetry breaking is tractable. It identifies several CSP classes which feature various forms of val...
متن کاملBoosting SBDS for Partial Symmetry Breaking in Constraint Programming
The paper proposes a dynamic method, Recursive SBDS (ReSBDS), for efficient partial symmetry breaking. We first demonstrate how (partial) Symmetry Breaking During Search (SBDS) misses important pruning opportunities when given only a subset of symmetries to break. The investigation pinpoints the culprit and in turn suggests rectification. The main idea is to add extra conditional constraints du...
متن کامل